Distance graphs and sets of positive upper density in ℝd
نویسندگان
چکیده
منابع مشابه
Simplices and Sets of Positive Upper Density in R
We prove an extension of Bourgain’s theorem on pinned distances in measurable subset of R2 of positive upper density, namely Theorem 1′ in [1], to pinned non-degenerate k-dimensional simplices in measurable subset of Rd of positive upper density whenever d ≥ k + 2 and k is any positive integer.
متن کاملMinimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs
For a set D ⊂ Zn, the distance graph Pn(D) has Zn as its vertex set and the edges are between vertices i and j with |i − j| ∈ D. The circulant graph Cn(D) is defined analogously by considering operations modulo n. The minimum feedback vertex set problem consists in finding the smallest number of vertices to be removed in order to cut all cycles in the graph. This paper studies the minimum feedb...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملDistance graphs with missing multiples in the distance sets
Given positive integers m, k and s with m > ks, let Dm,k,s represent the set {1, 2, · · · ,m} − {k, 2k, · · · , sk}. The distance graph G(Z,Dm,k,s) has as vertex set all integers Z and edges connecting i and j whenever |i − j| ∈ Dm,k,s. The chromatic number and the fractional chromatic number of G(Z,Dm,k,s) are denoted by χ(Z,Dm,k,s) and χf (Z,Dm,k,s), respectively. For s = 1, χ(Z,Dm,k,1) was s...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analysis & PDE
سال: 2020
ISSN: 1948-206X,2157-5045
DOI: 10.2140/apde.2020.13.685